Arc-transitive elementary abelian covers of the Pappus graph

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Arc-transitive abelian regular covers of the Heawood graph

In this sequel to the paper ‘Arc-transitive abelian regular covers of cubic graphs’, all arc-transitive abelian regular covers of the Heawood graph are found. These covers include graphs that are 1-arc-regular, and others that are 4-arc-regular (like the Heawood graph). Remarkably, also some of these covers are 2-arc-regular.

متن کامل

Arc-transitive abelian regular covers of cubic graphs

Quite a lot of attention has been paid recently to the construction of edgeor arc-transitive covers of symmetric graphs. In most cases, the approach has involved voltage graph techniques, which are excellent for finding regular covers in which the group of covering transformations is either cyclic or elementary abelian, or more generally, homocyclic, but are not so easy to use when the covering...

متن کامل

Arc-transitive regular cyclic covers of the complete bipartite graph

Characterizing regular covers of edge-transitive or arc-transitive graphs is currently a hot topic in algebraic graph theory. In this paper, we will classify arctransitive regular cyclic covers of the complete bipartite graph Kp,p for each odd prime p. The classification consists of four infinite families of graphs. In particular, such covers exist for each odd prime p. The regular elementary a...

متن کامل

Elementary Abelian Covers of Graphs

Let CG (X ) be the set of all (equivalence classes of) regular covering projections of a given connected graph X along which a given group G ≤ Aut X of automorphisms lifts. There is a natural lattice structure on CG (X ), where ℘1 ≤ ℘2 whenever ℘2 factors through ℘1. The sublattice CG (℘) of coverings which are below a given covering ℘ : X̃ → X naturally corresponds to a lattice NG (℘) of certai...

متن کامل

Almost Covers Of 2-Arc Transitive Graphs

Let Γ be a G-symmetric graph whose vertex set admits a nontrivial G-invariant partition B with block size v. Let ΓB be the quotient graph of Γ relative to B and Γ [B,C] the bipartite subgraph of Γ induced by adjacent blocks B,C of B. In this paper we study such graphs for which ΓB is connected, (G,2)-arc transitive and is almost covered by Γ in the sense that Γ [B,C] is a matching of v−1≥2 edge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2009

ISSN: 0012-365X

DOI: 10.1016/j.disc.2009.07.010